-
1 orientable graph
Большой англо-русский и русско-английский словарь > orientable graph
-
2 orientable graph
Математика: ориентируемый граф -
3 orientable graph
мат. -
4 strongly orientable graph
Математика: сильно ориентируемый графУниверсальный англо-русский словарь > strongly orientable graph
-
5 strongly orientable graph
English-Russian scientific dictionary > strongly orientable graph
-
6 orientable
ориентируемый, ориентирующийся absolutely orientable manifold ≈ абсолютно ориентируемое многообразие almost orientable manifold ≈ всегда ориентируемое многообразие locally orientable pencil ≈ локально ориентируемый пучок strongly orientable graph ≈ сильно ориентируемый граф transversally orientable bundle ≈ трансверсально ориентируемое расслоение - absolutely orientable - orientable atlas - orientable bundle - orientable circuit - orientable complex - orientable cone - orientable contour - orientable cover - orientable embedding - orientable fibration - orientable frame - orientable geodesic - orientable graph - orientable manifold - orientable matroid - orientable module - orientable pencil - orientable polyhedron - orientable pseudomanifold - orientable sheaf - orientable space - orientable subspace - orientable surface - strongly orientable - transversally orientableБольшой англо-русский и русско-английский словарь > orientable
-
7 graph
1) граф2) график || строить график3) диаграмма || чертить диаграмму•- alternating composition graph - arbitrarily transversable graph - derived graph - doubly connected graph - doubly transitive graph - fully connected graph - locally countable graph - locally finite graph - locally restricted graph - log-log graph - partially labeled graph - partially orderable graph - progressively finite graph - regressively finite graph - strictly weak graph - strongly orientable graph - strongly regular graph - strongly rigid graph - strongly singular graph - strongly smooth graph - totally inductive graph - triangleless graph - triply transitive graph - uniquely intersectable graph - uniquely representable graph - weakly disconnected graph -
8 ориентируемый граф
Большой англо-русский и русско-английский словарь > ориентируемый граф
-
9 manifold
1) коллектор; магистраль2) гребёнка4) геом. многообразие5) патрубок6) анат. летошка7) рампа; батарея газовых баллонов8) многократный; многократно9) камера; распределитель10) многообразный; разнообразный; разнородный•manifold with boundary — многообразие с границей, многообразие с краем
- almost homogeneous manifold - almost orientable manifold - almost parallelizable manifold - almost smooth manifold - completely parallelizable manifold - finitely compact manifold - finitely triangulated manifold - globally harmonic manifold - holomorphically convex manifold - locally homogeneous complex manifold - locally plane manifold - locally symmetric manifold - locally trivial manifold - locally unknotted manifold - maximal integral manifold - orbitally asymptotically stable manifold - strongly harmonic manifold - unlimited covering manifold - weighted homogeneous manifoldmanifold without boundaries — многообразие без границ, многообразие с краем
См. также в других словарях:
Graph embedding — In topological graph theory, an embedding of a graph G on a surface Sigma; is a representation of G on Sigma; in which points of Sigma; are associated to vertices and simple arcs (homeomorphic images of [0,1] ) are associated to edges in such a… … Wikipedia
Feynman graph — A Feynman graph is a graph suitable to be a Feynman diagram in a particular application of quantum field theory. (The most common use is when each field has quanta (particles) associated with it as the quantum of the electromagnetic field is a… … Wikipedia
Petersen graph — Infobox graph name = Petersen graph image caption = The Petersen graph is most commonly drawn as a pentagon with a pentagram inside, with five spokes. namesake = Julius Petersen vertices = 10 edges = 15 radius = 2 diameter = 2 girth = 5 chromatic … Wikipedia
Median graph — The median of three vertices in a median graph In mathematics, and more specifically graph theory, a median graph is an undirected graph in which any three vertices a, b, and c have a unique median: a vertex m(a,b,c) that belongs to shortest… … Wikipedia
Comparability graph — In graph theory, a comparability graph is an undirected graph that connects pairs of elements that are comparable to each other in a partial order. Comparability graphs have also been called transitively orientable graphs, partially orderable… … Wikipedia
Genus (mathematics) — In mathematics, genus has a few different, but closely related, meanings:TopologyOrientable surfaceThe genus of a connected, orientable surface is an integer representing the maximum number of cuttings along closed simple curves without rendering … Wikipedia
Cycle double cover — Unsolved problems in mathematics Does every bridgeless graph have a multiset of cycles covering every edge exactly twice? … Wikipedia
Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… … Wikipedia
Four color theorem — Example of a four colored map A four colori … Wikipedia
Heawood conjecture — The Heawood conjecture or Ringel–Youngs theorem in graph theory gives an upper bound for the number of colors which are sufficient for graph coloring on a surface of a given genus. It was proven in 1968 by Gerhard Ringel and J. W. T. Youngs. One… … Wikipedia
Polyhedron — Polyhedra redirects here. For the relational database system, see Polyhedra DBMS. For the game magazine, see Polyhedron (magazine). For the scientific journal, see Polyhedron (journal). Some Polyhedra Dodecahedron (Regular polyhedron) … Wikipedia
